Formal concept analysis of higher order
نویسندگان
چکیده
منابع مشابه
Formal Concept Analysis of Higher Order
The second order formal context is a formal context such that its object and attribute sets are disjoint unions of object and attribute sets of external formal contexts. Every subset of object or attribute set will be evaluated from concept lattice of corresponding external formal context. The paper provides a method how to compute such second order formal concepts by using of bonds between ext...
متن کاملFirst-Order Context and Formal Concept Analysis
Formal Concept Analysis -also called "Galois Lattices"is an algebraic model based on propositional calculus that is used for symbolic knowledge exploration from a formal context. The aim of this paper is to design the theoretical models required for the extension of Formal Concept Analysis to first-order logic so as to improve both the expression power as a knowledge mining tool upon first orde...
متن کاملCharacterization of Order-like Dependencies with Formal Concept Analysis
Functional Dependencies (FDs) play a key role in many fields of the relational database model, one of the most widely used database systems. FDs have also been applied in data analysis, data quality, knowledge discovery and the like, but in a very limited scope, because of their fixed semantics. To overcome this limitation, many generalizations have been defined to relax the crisp definition of...
متن کاملEvolutionary Higher-Order Concept Learning
Current concept learners are limited in their applicability as they generally rely on comparatively poor knowledge representation facilities (e.g. attribute value pairs, flattened horn clauses). The work carried out in support of my thesis has involved extending concept learning to a higher order setting by developing a novel representation based on closed Escher terms for highly structured dat...
متن کاملFormal Probabilistic Analysis: A Higher-Order Logic Based Approach
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time requirements. Recently, a significant amount of formalization has been done in higherorder logic that allows us to conduct precise probabilistic analysis using theorem proving and thus overcome the limitations of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of General Systems
سال: 2016
ISSN: 0308-1079,1563-5104
DOI: 10.1080/03081079.2015.1072924